Intersection Matrices Revisited
نویسندگان
چکیده
Several intersection matrices of s-subsets versus k-subsets of a v-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known identities appear as natural consequences of this viewpoint; especially, use of the derivative operator d/dz and some related operators reveals some connections between intersection matrices and the “combinatorics of creation-annihilation.” As application, the eigenvalues of several intersection matrices including some generalizations of the adjacency matrices of the Johnson scheme are derived; two new bases for the Bose–Mesner algebra of the Johnson scheme are introduced and the associated intersection numbers are obtained as well. Finally, we determine the rank of some intersection matrices. C © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 383–397, 2012
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملIntersection matrices and the Johnson scheme
In this paper we introduce a generating function F t sk(v)(z) which is a polynomial in terms of z whose coefficients are some intersection matrices. This provides a uniform framework in which several intersection matrices can be extracted from F t sk(v)(z). Several nice properties of F t sk(v)(z) are derived by applying the operator d/dz and studying the operator zd/dz. In the new framework som...
متن کاملStill Another Rank Determination of Set Intersection Matrices with an Application in Communication Complexity
The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in 4] and 5]. In this note, the rank of these matrices is determined by another method of proof, which makes use of a factorization into a produ...
متن کاملIntersection graphs of oriented hypergraphs and their matrices
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. Continuing the study of these matrices associated to an oriented hypergraph, several related structures are investigated including: the incidence dual, the intersection graph (line graph), and the 2-section. The intersection graph is show...
متن کامل